Fusing Vantage Point Trees and Linear Discriminants for Fast Feature Classification
نویسندگان
چکیده
منابع مشابه
Speeding Melody Search With Vantage Point Trees
Melodic search engines let people find music in online collections by specifying the desired melody. Comparing the query melody to every item in a large database is prohibitively slow. If melodies can be placed in a metric space, search can be sped by comparing the query to a limited number of vantage melodies, rather than the entire database. We describe a simple melody metric that is customiz...
متن کاملSeparability of Point Sets by k-Level Linear Classification Trees
∗A preliminary version of this work appeared in the Abstracts of the 26th European Workshop on Computational Geometry, Dortmund (Germany), 2010, pp. 41–44. E. Arkin and J. Mitchell are partially supported by the National Science Foundation (CCF-0729019, CCF-1018388). D. Garijo and A. Márquez are partially supported by project MTM2008-05866-C03-01. C. Seara is partially supported by projects MTM...
متن کاملFast Fuzzy Feature Clustering for Text Classification
Feature clustering is a powerful method to reduce the dimensionality of feature vectors for text classification. In this paper, Fast Fuzzy Feature clustering for text classification is proposed. It is based on the framework proposed by Jung-Yi Jiang, Ren-Jia Liou and Shie-Jue Lee in 2011. The word in the feature vector of the document is grouped into the cluster in less iteration. The numbers o...
متن کاملEmotion and vantage point in autobiographical
Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opin...
متن کاملNon-Linear Feature Selection for Classification
This paper addresses the issues associated with performing feature or parameter selection for non-linear classifiers using a basis pursuit regularization framework. New results on representing the feature selection problem as a primal/dual calculation for both hard and soft margin classification problems are derived, and it is shown that optimal feature selection can be posed, in dual form, as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Classification
سال: 2017
ISSN: 0176-4268,1432-1343
DOI: 10.1007/s00357-017-9223-0